Efficient Computation of Greyscale Path Openings
نویسندگان
چکیده
منابع مشابه
Fast Computation of Greyscale Path Openings
Path openings are morphological operators that are used to preserve long, thin, and curved structures in images. They have the ability to adapt to local image structures, which allows them to detect lines that are not perfectly straight. They are applicable in extracting cracks, roads, and more. Although path openings are very efficient to implement for binary images, the greyscale case is more...
متن کاملEfficient Computation of Morphological Greyscale Reconstruction
Morphological reconstruction is an important image operator from mathematical morphology. It is very often used for filtering, segmentation, and feature extraction. However, its computation can be very time-consuming for some input data. In this paper we review several efficient algorithms to compute the reconstruction, and compare their performance on real 3D images of large sizes. Furthermore...
متن کاملEfficient Path Openings and Closings
Path openings and closings are algebraic morphological operators using families of thin and oriented structuring elements that are not necessarily perfectly straight. These operators are naturally translation invariant and can be used in filtering applications instead of operators based on the more standard families of straight line structuring elements. They give similar results to area or att...
متن کاملEfficient complete and incomplete path openings and closings
Path openings and closings are algebraic morphological operators using families of thin and oriented structuring elements that are not necessarily perfectly straight. These operators can typically be used in filtering applications in lieu of operators based on the more standard families of straight line structuring elements. They yield results which are less constrained than filters based on st...
متن کاملExploiting Road Network Properties in Efficient Shortest‐path Computation
The essential elements of any navigation system are a shortest‐path algorithm and a map dataset. When seen in the light of the basic requirement of such a system, to provide high quality navigation solutions fast, algorithms have to be efficient and road networks have to be up‐to‐date. The contribution of this work is two‐fold. First, the HBA* algorithm, an efficient shortest‐path algorithm, is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Morphology - Theory and Applications
سال: 2016
ISSN: 2353-3390
DOI: 10.1515/mathm-2016-0010